Bounded Parallelism in Array Grammars Used for Character Recognition
نویسندگان
چکیده
The aim of this paper is to elaborate the power of cooperation in generating and analysing (handwritten) characters by array grammars. We present various non-context-free sets of arrays that can be generated in a simple way by cooperating distributed array grammar systems with prescribed teams working in diierent modes and show the power of the mechanism of cooperation for picture description and analysis as well as the eeciency of these models where several sets of productions work in parallel on the given sentential form.
منابع مشابه
An Application of Array Token Petri Nets to Clustering Analysis for Syntactic Patterns
H. Fernau, R. Freund and M. Holzer, Character recognition with k-head finite array automata, Advances in Pattern Recognition, Lecture Notes in Computer Science, 1998, Volume 1451, pp 282-291. H. Fernau and R. Freund, Bounded Parallelism in Array Grammars used for Character Recognition, Advances in Structural and Syntactical Pattern Recognition, Lecture Notes in Computer Science, 1996, Volume 11...
متن کاملRegulated Array Grammars of Finite Index. Part II: Syntactic Pattern Recognition
We introduce special k-head finite array automata, which characterize the array languages generated by specific variants of regulated n-dimensional context-free array grammars of finite index we introduced in the first part of this paper. As a practical application we show how these analyzing devices in the two-dimensional case can be used in the field of syntactic character recognition. 1 Brid...
متن کاملRegulated Array Grammars of Finite Index. Part I: Theoretical Investigations
We consider regulated (n-dimensional) context-free array grammars of nite index, i.e., with a limited number of active areas. This research is motivated by the observation that in several practical applications of array grammars only such a bounded number of active areas is observed. Combined with diierent methods known from regulated rewriting (e.g., matrix grammars, programmed grammars, gramm...
متن کاملBounded Approximate Character Amenability of Banach Algebras
The bounded approximate version of $varphi$-amenability and character amenability are introduced and studied. These new notions are characterized in several different ways, and some hereditary properties of them are established. The general theory for these concepts is also developed. Moreover, some examples are given to show that these notions are different from the others. Finally, bounded ap...
متن کاملNeural Network Based Recognition System Integrating Feature Extraction and Classification for English Handwritten
Handwriting recognition has been one of the active and challenging research areas in the field of image processing and pattern recognition. It has numerous applications that includes, reading aid for blind, bank cheques and conversion of any hand written document into structural text form. Neural Network (NN) with its inherent learning ability offers promising solutions for handwritten characte...
متن کامل